Some bounds on chromatic number of NI graphs
نویسندگان
چکیده
A connected graph is called neighbourly irregular (NI) if it contains no edge between the vertices of the same degree. In this paper we determine the upper bound for chromatic number of a neighbourly irregular graph. We also prove some results on neighbourly irregular graphs and its chromatic number.
منابع مشابه
On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملBounds for the b-chromatic number of some families of graphs
In this paper we obtain some upper bounds for b-chromatic number of K1,t -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight. AMS Classification: 05C15.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کامل